Robustness analysis of network controllability
نویسندگان
چکیده
Structural controllability, which is an interesting property of complex networks, attracts many researchers from various fields. The maximum matching algorithm was recently applied to explore the minimum number of driver nodes, where control signals are injected, for controlling the whole network. Here we study the controllability of directed Erdös–Rényi and scale-free networks under attacks and cascading failures. Results show that degree-based attacks are more efficient than random attacks on network structural controllability. Cascade failures also do great harm to network controllability even if they are triggered by a local node failure. © 2012 Elsevier B.V. All rights reserved.
منابع مشابه
Optimization of robustness of interdependent network controllability by redundant design
Controllability of complex networks has been a hot topic in recent years. Real networks regarded as interdependent networks are always coupled together by multiple networks. The cascading process of interdependent networks including interdependent failure and overload failure will destroy the robustness of controllability for the whole network. Therefore, the optimization of the robustness of i...
متن کاملRobustness of Network Controllability under Edge Removal
We introduce a quantitative measure of robustness of network controllability. Given a set of control nodes which drive the network, we investigate the effect of edge removal on the number of controllable nodes. We find that the mean degree of the network is a major factor in determining the robustness of random networks. Nonetheless, a comparison between real and random networks indicates a sta...
متن کاملOptimal Leader Selection in Multi-agent Networks: Joint Centrality, Robustness and Controllability
In many engineered and natural multi-agent networked systems, a limited subset of agents, called leaders, have access to external information, while the remaining agents, called followers, obtain information through network connections. In this dissertation, we connect measures of group-level performance with properties of the underlying network. Specifically, we determine which nodes in the ne...
متن کاملAttack Vulnerability of Network Controllability
Controllability of complex networks has attracted much attention, and understanding the robustness of network controllability against potential attacks and failures is of practical significance. In this paper, we systematically investigate the attack vulnerability of network controllability for the canonical model networks as well as the real-world networks subject to attacks on nodes and edges...
متن کاملToward Stronger Robustness of Network Controllability: A Snapback Network Model
A new complex network model, called q-snapback network, is introduced. Basic topological characteristics of the network, such as degree distribution, average path length, clustering coefficient and Pearson correlation coefficient, are evaluated. The typical 4-motifs of the network are simulated. The robustness of both state and structural controllabilities of the network against targeted and ra...
متن کامل